Experimental Quantum Computing without Entanglement
نویسندگان
چکیده
منابع مشابه
Experimental quantum computing without entanglement.
Deterministic quantum computation with one pure qubit (DQC1) is an efficient model of computation that uses highly mixed states. Unlike pure-state models, its power is not derived from the generation of a large amount of entanglement. Instead it has been proposed that other nonclassical correlations are responsible for the computational speedup, and that these can be captured by the quantum dis...
متن کاملQuantum computing without entanglement
It is generally believed that entanglement is essential for quantum computing. We present here a few simple examples in which quantum computing without entanglement is better than anything classically achievable, in terms of the reliability of the outcome after a fixed number of oracle calls. Using a separable (that is, unentangled) n-qubit state, we show that the Deutsch-Jozsa problem and the ...
متن کاملQuantum Computing and Entanglement
While physicists are continually looking for ways to unify the theory of relativity, which describes large-scale phenomena, with quantum theory, which describes small-scale phenomena, computer scientists are searching for technologies to build the quantum computer. The accelerating electrons explain not only the Maxwell Equations and the Special Relativity, but the Heisenberg Uncertainty Relati...
متن کاملQuantum Nonlocality without Entanglement
Charles H. Bennett, David P. DiVincenzo, Christopher A. Fuchs, Tal Mor, Eric Rains, Peter W. Shor, John A. Smolin, and William K. Wootters IBM Research Division, T. J. Watson Research Center, Yorktown Heights, NY 10598 Norman Bridge Laboratory of Physics 12-33, California Institute of Technology, Pasadena, CA 91125 Département d’Informatique et de Recherche Opérationelle, CP 6128, Succ. Centre-...
متن کاملQuantum advantage without entanglement
We study the advantage of pure-state quantum computation without entanglement over classical computation. For the Deutsch-Jozsa algorithm we present the maximal subproblem that can be solved without entanglement, and show that the algorithm still has an advantage over the classical ones. We further show that this subproblem is of greater significance, by proving that it contains all the Boolean...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review Letters
سال: 2008
ISSN: 0031-9007,1079-7114
DOI: 10.1103/physrevlett.101.200501